Fine-tuning of boolean formulae preprocessing techniques
نویسندگان
چکیده
This paper presents constant propagation and common factors rewriting methods for boolean formula preprocessing. Formula rewriting performs symbolic simplification, and attempts to reconstitute hidden structure in the model that was lost by the conversion to a boolean formula. We show examples of fault trees whose assessment becomes feasible only after this kind of preprocessing.
منابع مشابه
Preprocessing Boolean Formulae for BDDs in a Probabilistic Context
Inference in many probabilistic logic systems is based on representing the proofs of a query as a DNF Boolean formula. Assessing the probability of such a formula is known as a #P-hard task. In practice, a large DNF is given to a BDD software package to construct the corresponding BDD. The DNF has to be transformed into the input format of the package. This is the preprocessing step. In this pa...
متن کاملSBT: SatBox with Theories
Recent advances in SAT solvers based on CNF have focused, in particular, on innovative techniques for Boolean constraint propagation (BCP), variable selection, and back-jumping with conflict-driven learning. These techniques have proved to be critical for the high performance of SAT solvers. A great effort by the SAT community has been made to present these SAT techniques clearly and neatly so ...
متن کاملFormula Preprocessing in MUS Extraction
Efficient algorithms for extracting minimally unsatisfiable subformulas (MUSes) of Boolean formulas find a wide range of applications in the analysis of systems, e.g., hardware and software bounded model checking. In this paper we study the applicability of preprocessing techniques for Boolean satisfiability (SAT) in the context of MUS extraction. Preprocessing has proven to be extremely import...
متن کاملImprovements to the Evaluation of Quanti ed Boolean
We present a theorem-prover for quantiied Boolean formulae and evaluate it on random quantiied formulae and formulae that represent problems from automated planning. Even though the notion of quantiied Boolean formula is theoretically important, automated reasoning with QBF has not been thoroughly investigated. Universal quantiiers are needed in representing many computational problems that can...
متن کاملSpace-Efficient Bounded Model Checking
Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. Methods based on the validity of Quantified Boolean Formulae (QBF) allow an exponentially more succinct representation of formulae to be checked, because no “unrolling” of the transition relation is required. These methods have not been widely used, because of the lack of an efficient ...
متن کامل